The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
نویسندگان
چکیده
منابع مشابه
The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
This paper considers the uncapacitated lot sizing problem with batch delivery, focusing on the general case of timedependent batch sizes. We study the complexity of the problem, depending on the other cost parameters, namely the setup cost, the fixed cost per batch, the unit procurement cost and the unit holding cost. We establish that if any one of the cost parameters is allowed to be time-dep...
متن کاملPolynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
This paper presents two polynomial time algorithms for the constant capacitated lot sizing problem with a batch production. We give several optimality properties for the general problem. Assuming constant production capacity, constant batch size and WagnerWhitin cost structure, we derive O(T ) and O(T ) time algorithms respectively for the case with production capacity multiple of the batch siz...
متن کاملPolynomial time algorithms for constant capacitated single-item lot sizing problem with stepwise production cost
This paper presents two polynomial time algorithms for the constant capacitated lot sizing problem with a batch production. We give several optimality properties for the general problem. Assuming constant production capacity, constant batch size and WagnerWhitin cost structure, we derive O(T 4) and O(T 6) time algorithms respectively for the case with production capacity multiple of the batch s...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملPolynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production planning problems. In this paper we consider a basic version of this model in which demands (and other problem parameters) are stochastic: the stochastic uncapacitated lot-sizing problem (SULS). We define the production pat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2013
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2013.02.052